Quantum gambling based on Nash-equilibrium
نویسندگان
چکیده
منابع مشابه
Nash equilibrium
In game theory, Nash equilibrium (named after John Forbes Nash, who proposed it) is a solution concept of a game involving two or more players, in which each player is assumed to know the equilibrium strategies of the other players, and no player has anything to gain by changing only his own strategy unilaterally. If each player has chosen a strategy and no player can benefit by changing his or...
متن کاملNash Equilibrium of Node Cooperation Based on Metamodel for MANETs
In MANETs, most network functions count on node cooperation. Forwarding packets of other nodes is a basic example of such cooperation. However, nodes may not be interested in forwarding the requested packets because of being selfishness or malice, which significantly degrades network performance. Therefore, in respect of node forwarding process, we propose a global punishment-based repeated-gam...
متن کاملThe Intrinsic Quantum Nature of Nash Equilibrium Mixtures
The concept of Nash equilibrium has become central in game theory, economics, and other social sciences. A Nash equilibrium is defined as an n-tuple of strategies or strategy profile (one strategy for each player) if each player’s strategy is optimal against the others’ strategies. As is well-known by now, the interactive epistemology under which rational individuals play such a “social equilib...
متن کاملNo fixed point guarantee of Nash equilibrium in quantum games
The theory of quantum games permits players to choose strategies that prepare and measure quantum states. Whereas conventional game theory provides guarantees for fixed-point stability in non-cooperative games, so-called Nash equilibria, we find this guarantee is not provided for quantum games. In particular, we show the conditions for Glickberg’s fixed-point theorem do not apply to pure quantu...
متن کاملOn Computing Nash Equilibrium in Stochastic Games
Using the fact that any two player discounted stochastic game with finite state and action spaces can be recast as a non-convex constrained optimization problem, where each global minima corresponds to a stationary Nash equilibrium, we present a sequential quadratic programming based algorithm that converges to a KKT point. This KKT point is an -Nash equilibrium for some > 0 and under some suit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: npj Quantum Information
سال: 2017
ISSN: 2056-6387
DOI: 10.1038/s41534-017-0021-7